A Complete Algorithm for Generating Landmarks
نویسندگان
چکیده
A collection of landmarks is complete if the cost of a minimum-cost hitting set equals h and there is a minimumcost hitting set that is an optimal relaxed plan. We present an algorithm for generating a complete collection of landmarks and we show that this algorithm can be extended into effective polytime heuristics for optimal and satisficing planning. The new admissible heuristics are compared with current state-ofthe-art heuristics for optimal planning on benchmark prob-
منابع مشابه
Probability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملProblem Splitting Using Heuristic Search in Landmark Orderings
In this paper, we revisit the idea of splitting a planning problem into subproblems hopefully easier to solve with the help of landmark analysis. While this technique initially proposed in the first approaches related to landmarks has been outperformed by landmark-based heuristics, we believe that it is still a promising research direction. To this end, we propose a new method for problem split...
متن کاملAutomatic Landmark Generation for Point Distribution Models
Point Distribution Models (PDMs) are statistically derived flexible templates which are trained on sets of examples of the object(s) to be modelled. They require that each example is represented by a set of points (landmaiks) and that each landmark represents the same location on each of the examples. Generating the landmarks from 2D boundaries or 3D surfaces has previously been a manual proces...
متن کاملThe IUFP Algorithm for Generating Simulation Heart
In all systems simulation, random variates are considered as a main factor and based of simulation heart. Actually, randomization is inducted by random variates in the simulation. Due to the importance of such a problem, a new method for generation of random variates from continuous distributions is presented in this paper. The proposed algorithm, called uniform fractional part (UFP) is simpler...
متن کاملExtending the OGC OpenLS Route Service to 3D for an interoperable realisation of 3D focus maps with landmarks
Landmarks and focus maps can play an important role by supporting users in route finding and navigation. This article shows one possible solution for generating focus-based maps with landmarks by only using OGC web service standards. The aim is to increase technical interoperability of implementation of location-based services or navigation applications. The techniques for choosing specific lan...
متن کامل